The isodiametric problem with lattice-point constraints

In this paper, the isodiametric problem for centrally symmetric convex bodies in the Euclidean d-space R^d containing no interior non-zero point of a lattice L is studied. It is shown that the intersection of a suitable ball with the Dirichlet-Voronoi cell of 2L is extremal, i.e., it has minimum diameter among all bodies with the same volume. It is conjectured that these sets are the only extremal bodies, which is proved for all three dimensional and several prominent lattices.Comment: 12 pages, 4 figures, (v2) referee comments and suggestions incorporated, accepted in Monatshefte fuer Mathemati

On the variational interpretation of the discrete KP equation

We study the variational structure of the discrete Kadomtsev-Petviashvili (dKP) equation by means of its pluri-Lagrangian formulation. We consider the dKP equation and its variational formulation on the cubic lattice ${\mathbb Z}^{N}$ as well as on the root lattice $Q(A_{N})$. We prove that, on a lattice of dimension at least four, the corresponding Euler-Lagrange equations are equivalent to the dKP equation.Comment: 24 page

Residue codes of extremal Type II Z_4-codes and the moonshine vertex operator algebra

In this paper, we study the residue codes of extremal Type II Z_4-codes of length 24 and their relations to the famous moonshine vertex operator algebra. The main result is a complete classification of all residue codes of extremal Type II Z_4-codes of length 24. Some corresponding results associated to the moonshine vertex operator algebra are also discussed.Comment: 21 pages, shortened from v

Cocliques of maximal size in the prime graph of a finite simple group

In this paper we continue our investgation of the prime graph of a finite simple group started in http://arxiv.org/abs/math/0506294 (the printed version appeared in [1]). We describe all cocliques of maximal size for all finite simple groups and also we correct mistakes and misprints from our previous paper. The list of correction is given in Appendix of the present paper.Comment: published version with correction

Spherical designs and lattices

In this article we prove that integral lattices with minimum <= 7 (or <= 9) whose set of minimal vectors form spherical 9-designs (or 11-designs respectively) are extremal, even and unimodular. We furthermore show that there does not exist an integral lattice with minimum <=11 which yields a 13-design.Comment: The final publication is available at http://link.springer.com/article/10.1007%2Fs13366-013-0155-

Concurrent Kleene Algebra: Free Model and Completeness

Concurrent Kleene Algebra (CKA) was introduced by Hoare, Moeller, Struth and Wehrman in 2009 as a framework to reason about concurrent programs. We prove that the axioms for CKA with bounded parallelism are complete for the semantics proposed in the original paper; consequently, these semantics are the free model for this fragment. This result settles a conjecture of Hoare and collaborators. Moreover, the techniques developed along the way are reusable; in particular, they allow us to establish pomset automata as an operational model for CKA.Comment: Version 2 includes an overview section that outlines the completeness proof, as well as some extra discussion of the interpolation lemma. It also includes better typography and a number of minor fixes. Version 3 incorporates the changes by comments from the anonymous referees at ESOP. Among other things, these include a worked example of computing the syntactic closure by han

Vertex operator algebras and operads

Vertex operator algebras are mathematically rigorous objects corresponding to chiral algebras in conformal field theory. Operads are mathematical devices to describe operations, that is, $n$-ary operations for all $n$ greater than or equal to $0$, not just binary products. In this paper, a reformulation of the notion of vertex operator algebra in terms of operads is presented. This reformulation shows that the rich geometric structure revealed in the study of conformal field theory and the rich algebraic structure of the theory of vertex operator algebras share a precise common foundation in basic operations associated with a certain kind of (two-dimensional) ``complex'' geometric object, in the sense in which classical algebraic structures (groups, algebras, Lie algebras and the like) are always implicitly based on (one-dimensional) ``real'' geometric objects. In effect, the standard analogy between point-particle theory and string theory is being shown to manifest itself at a more fundamental mathematical level.Comment: 16 pages. Only the definitions of "partial operad" and of "rescaling group" have been improve

Free randomness can be amplified

Are there fundamentally random processes in nature? Theoretical predictions, confirmed experimentally, such as the violation of Bell inequalities, point to an affirmative answer. However, these results are based on the assumption that measurement settings can be chosen freely at random, so assume the existence of perfectly free random processes from the outset. Here we consider a scenario in which this assumption is weakened and show that partially free random bits can be amplified to make arbitrarily free ones. More precisely, given a source of random bits whose correlation with other variables is below a certain threshold, we propose a procedure for generating fresh random bits that are virtually uncorrelated with all other variables. We also conjecture that such procedures exist for any non-trivial threshold. Our result is based solely on the no-signalling principle, which is necessary for the existence of free randomness.Comment: 5+7 pages, 2 figures. Updated to match published versio

Programmability of Chemical Reaction Networks

Motivated by the intriguing complexity of biochemical circuitry within individual cells we study Stochastic Chemical Reaction Networks (SCRNs), a formal model that considers a set of chemical reactions acting on a finite number of molecules in a well-stirred solution according to standard chemical kinetics equations. SCRNs have been widely used for describing naturally occurring (bio)chemical systems, and with the advent of synthetic biology they become a promising language for the design of artificial biochemical circuits. Our interest here is the computational power of SCRNs and how they relate to more conventional models of computation. We survey known connections and give new connections between SCRNs and Boolean Logic Circuits, Vector Addition Systems, Petri Nets, Gate Implementability, Primitive Recursive Functions, Register Machines, Fractran, and Turing Machines. A theme to these investigations is the thin line between decidable and undecidable questions about SCRN behavior

11 x 11 Domineering is Solved: The first player wins

We have developed a program called MUDoS (Maastricht University Domineering Solver) that solves Domineering positions in a very efficient way. This enables the solution of known positions so far (up to the 10 x 10 board) much quicker (measured in number of investigated nodes). More importantly, it enables the solution of the 11 x 11 Domineering board, a board up till now far out of reach of previous Domineering solvers. The solution needed the investigation of 259,689,994,008 nodes, using almost half a year of computation time on a single simple desktop computer. The results show that under optimal play the first player wins the 11 x 11 Domineering game, irrespective if Vertical or Horizontal starts the game. In addition, several other boards hitherto unsolved were solved. Using the convention that Vertical starts, the 8 x 15, 11 x 9, 12 x 8, 12 x 15, 14 x 8, and 17 x 6 boards are all won by Vertical, whereas the 6 x 17, 8 x 12, 9 x 11, and 11 x 10 boards are all won by Horizontal